Greedy algorithms in Datalog

Greedy Algorithms in Datalog

In the design of algorithms, the greedy paradigm provides a powerful tool for solving efficiently classical computational problems, within the framework of procedural languages. However, expressing these algorithms within the declarative framework of logic-based languages has proven a difficult research challenge. In this paper, we extend the framework of Datalog-like languages to obtain simple...

Greedy Algorithms in Datalog with Choice and Negation

In the design of algorithms, the greedy paradigm provides a powerful tool for solving eeciently classical computational problems, within the framework of procedural languages. However, expressing these algorithms within the declarative framework of logic-based languages has proven a diicult research challenge. In this paper, we extend the framework of Datalog-like languages to obtain simple dec...

Greedy Algorithms

Greedy in Approximation Algorithms

The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k-extendible systems, a natural generalization of matroids, and show that a greedy algorithm is a 1 k -factor approximation for these systems. Many seemly unrelated problems fit in our framework, e.g.: b-matching, maxi...

Advances in Greedy Algorithms

ing and non-profit use of the material is permitted with credit to the source. Statements and opinions expressed in the chapters are these of the individual contributors and not necessarily those of the editors or publisher. No responsibility is accepted for the accuracy of information contained in the published articles. Publisher assumes no responsibility liability for any damage or injury to...